Symbolic Cost Estimation of Parallel Applications
نویسنده
چکیده
Symbolic cost models are an important performance engineering tool because of their diagnostic value and their very low solution cost when the computation features regularity. However, especially for parallel applications their derivation, including the symbolic simplifications essential for low solution cost, is an effort-intensive and error-prone process. We present a tool that automatically compiles process-oriented performance simulation models into symbolic cost models that are symbolically simplified to achieve extremely low solution cost. As the simulation models are intuitively close to the parallel program and machine under study, derivation effort is significantly reduced. Apart from its use as a stand-alone tool, the compiler is also used within a symbolic cost estimator for data-parallel programs. With minimal program annotation by the user, symbolic cost models are automatically generated in a matter of seconds, while the evaluation time of the models ranges in the milliseconds. Experimental results on four data-parallel programs show that the average prediction error is less than 15 %. Apart from providing program scalability assessment, the models correctly predict the best design alternative in all cases.
منابع مشابه
Automatic Cost Estimation of High-Performance Applications
In high-performance computing symbolic cost estimation is an important engineering tool that allows rapid insight in the performance effects of coding or data partitioning alternatives. In this paper we present an automatic cost estimator that compiles data parallel programs into symbolic performance models of very low solution complexity. With minimal program annotation by the user, symbolic c...
متن کاملTrade-oos in Symbolic Cost Estimation of Parallel Programs
Analytic cost estimation is a valuable aid to assess the eeect of various machine and mapping parameters on program performance. Cost estimation is either based on a model of the parallel algorithm or on a model of the actually generated machine code. Especially in case of a distributed-memory system the diierence in abstraction is large. In this paper we study the trade-oo between analytic cos...
متن کاملImplementation of the direction of arrival estimation algorithms by means of GPU-parallel processing in the Kuda environment (Research Article)
Direction-of-arrival (DOA) estimation of audio signals is critical in different areas, including electronic war, sonar, etc. The beamforming methods like Minimum Variance Distortionless Response (MVDR), Delay-and-Sum (DAS), and subspace-based Multiple Signal Classification (MUSIC) are the most known DOA estimation techniques. The mentioned methods have high computational complexity. Hence using...
متن کاملDynamic Performance Prediction for Scalable Parallel Computing
Performance prediction is necessary in order to deal with multi-dimensional performance eeects on parallel systems. The compiler-generated analytical model developed in this paper accounts for the eeects of cache behavior, CPU execution time and message passing overhead for real programs written in high level data-parallel languages. The performance prediction technique is shown to be eeective ...
متن کاملDesign of an Optical Content-Addressable Parallel Processor with Applications to Fast Searching and Information Retrieval
Associative processing based on content-addressable memories has been argued to be the natural solution for non-numerical information processing applications. Unfortunately, the implementation requirements of these architectures using conventional electronic technology have been very cost prohibitive, and therefore associative processors have not been realized. Optics has the capability over el...
متن کامل